Information Theoretic Bounds for Compressed Sensing
نویسندگان
چکیده
منابع مشابه
Information theoretic bounds for data hiding in compressed images
We present an information-theoretic approach to obtain an estimate of the number of bits that can be hidden in still images, or, the capacity of the data-hiding channel. We show how addition of the message signal in a suitable transform domain rather than the spatial domain can signiicantly increase the channel capacity. We compare the capacities achievable with diierent decompositions like DCT...
متن کاملInformation theoretic bounds to performance of Compressed Sensing and Sensor Networks
In this paper we derive information theoretic performance bounds to sensing and reconstruction of sparse phenomena from noisy random projections of data. The problem has received significant interest in Compressed Sensing and Sensor Networks(SNETs) literature. Our goal here is two-fold: (a) analyze these problems in an information theoretic setting, namely, provide algorithm independent perform...
متن کاملAn Information-Theoretic Approach to Distributed Compressed Sensing
Compressed sensing is an emerging field based on the revelation that a small group of linear projections of a sparse signal contains enough information for reconstruction. In this paper we introduce a new theory for distributed compressed sensing (DCS) that enables new distributed coding algorithms for multi-signal ensembles that exploit both intraand inter-signal correlation structures. The DC...
متن کاملCompressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds
We address the problem of compressed sensing (CS) with prior information: reconstruct a target CS signal with the aid of a similar signal that is known beforehand, our prior information. We integrate the additional knowledge of the similar signal into CS via l1-l1 and l1-l2 minimization. We then establish bounds on the number of measurements required by these problems to successfully reconstruc...
متن کاملImproved Bounds for RIC in Compressed Sensing
This paper improves bounds for restricted isometry constant (RIC) in compressed sensing. Let Φ be a m × n real matrix and k be a positive integer with k ≤ n. The main results of this paper show that if the restricted isometry constant of Φ satisfies δk+ak < 3 2 − 1 + √ (4a+ 3)2 − 8 8a for a > 3 8 , then k-sparse solution can be recovered exactly via l1 minimization in the noiseless case. In par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2059891